package complexity;

public class Insert {
    public static void sort(Comparable[] comparable){
        for (int i = 1; i < comparable.length; i++) {
            for (int j = 0; j < i; j++) {
                if (Bubble.greater(comparable[j],comparable[i])){
                    Bubble.exChange(comparable,i,j);
                }else {
                    break;
                }
            }
        }
    }
}
